

lst = [90, 88, 67, 92, 38, 100, 77]

def quick_sort(lst):
    if len(lst)<2:
        return lst
    else:
        left = []
        right = []
        mid = [lst[0]]
        for i in range(1, len(lst)):
            if lst[i] > lst[0]:
                right.append(lst[i])
            elif lst[i]<lst[0]:
                left.append(lst[i])
            else:
                mid.append(lst[i])
        left = quick_sort(left)
        right = quick_sort(right)
        return left+mid+right


print(quick_sort(lst))


